Fuzzy Array Dataaow Analysis
نویسندگان
چکیده
Exact array dataaow analysis can be achieved in the general case if the only control structures are do-loops and structural ifs, and if loop counter bounds and array subscripts are aane expressions of englobing loop counters and possibly some integer constants. In this paper , we begin the study of dataaow analysis of dynamic control programs, where arbitrary ifs and whiles are allowed. In the general case, this dataaow analysis can only be fuzzy.
منابع مشابه
Applications of Fuzzy Array Dataaow Analysis
Array dataaow analysis can be exact in the general case when it involves only aane constraints on loop counters. This paper rst presents an iterative method in the framework of Fuzzy Array Dataaow Analysis and then describes applications of fuzzy analysis on some usual techniques in compilation and parallelization.
متن کاملFuzzy Array Data
Exact array dataaow analysis can be achieved in the general case if the only control structures are the sequence, the do-loop and restricted ifs, and if loop counter bounds and array subscripts are aane expressions of surrounding loop counters and possibly some integer constants. In this paper, we begin the study of dataaow analysis of dynamic control programs, where arbitrary ifs and whiles ar...
متن کاملFuzzy Array Data ow Analysis
Dataaow analyses track the deenitions and uses of variable values, and are useful to optimizing and parallelizing compilers. Such analyses compute, for every (array cell) value read in a right-hand-side expression, the very operation which produced it. These analyses, however, make quite stringent hypotheses on the input programs: the control ow should be known at compile-time (i.e., static), a...
متن کاملAn Interprocedural Parallelizing Compiler and Its Support for Memory Hierarchy Research
We present several new compiler techniques employed by our interprocedural parallelizing research compiler, Panorama, to improve loop parallelization and the eeciency of memory references. We rst present an overview of the compiler and its associated memory architecture simulation environments. We then present an interprocedural array dataaow analysis, using guarded array regions, for automatic...
متن کاملOptimizing Sparse Representations for Data
Sparse program representations allow inter-statement dependences to be represented explicitly, enabling dataaow analyzers to restrict the propagation of information to paths where it could potentially aaect the dataaow solution. This paper describes the use of a single sparse program representation , the value dependence graph, in both general and analysis-specic contexts, and demonstrates its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995